THE CRITICAL EXPONENT IS COMPUTABLE FOR AUTOMATIC SEQUENCES
نویسندگان
چکیده
منابع مشابه
The Critical Exponent is Computable for Automatic Sequences
The critical exponent of an infinite word is defined to be the supremum of the exponent of each of its factors. For k-automatic sequences, we show that this critical exponent is always either a rational number or infinite, and its value is computable. Our results also apply to variants of the critical exponent, such as the initial critical exponent of Berthé, Holton, and Zamboni and the Diophan...
متن کاملOne-arm Exponent for Critical 2d Percolation
The probability that the cluster of the origin in critical site percolation on the triangular grid has diameter larger than R is proved to decay like R−5/48 as R→ ∞.
متن کاملComputable Exchangeable Sequences Have Computable de Finetti Measures
We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably recovering a distribution from its sequence of moments, which suffices to prove the theorem in the case of (almost surely) continuous directing random measures. In the general case, we give a proof inspired by a randomized algori...
متن کاملDescriptive Complexity of Computable Sequences
Our goal is to study the complexity of infinite binary recursive sequences. We introduce several measures of the quantity of information they contain. Some measures are based on size of programs that generate the sequence, the others are based on the Kolmogorov complexity of its finite prefixes. The relations between these complexity measures are established. The most surprising among them are ...
متن کاملCritical Exponent for Gap Filling at Crisis.
A crisis in chaotic dynamical systems is characterized by the conversion of a nonattracting, Cantorset-like chaotic saddle into a chaotic attractor. The gaps in between various pieces of the chaotic saddle are densely filled after the crisis. We give a quantitative scaling theory for the growth of the topological entropy for a major class of crises, the interior crisis. The theory is confirmed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2012
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054112400655